@inproceedings{Belazzougui,
  title={{Succinct dictionary matching with no slowdown}},
  author={Belazzougui, D.},
  booktitle={CPM 2010},
  volume={6129},
  series={LNCS},
  pages={88--100},
  year={2010},
  organization={Springer}
}

@article{BellerGogOhlebuschSchnattinger,
  title={{Computing the longest common prefix array based on the Burrows--Wheeler transform}},
  author={Beller, T. and Gog, S. and Ohlebusch, E. and Schnattinger, T.},
  journal={J. of Discrete Algorithms},
  volume={18},
  pages={22--31},
  year={2013},
  publisher={Elsevier}
}

@incollection{BenderColeDemaineFarachColtonZito,
  title={{Two simplified algorithms for maintaining order in a list}},
  author={Bender, M. A. and Cole, R. and Demaine, E. D. and Farach-Colton, M. and Zito, J.},
  booktitle={Algorithms-ESA 2002},
  volume={2461},
  series={LNCS},
  pages={152--164},
  year={2002},
  publisher={Springer}
}

@inproceedings{BentleySedgewick,
  title={Fast algorithms for sorting and searching strings},
  author={Bentley, J. L. and Sedgewick, R.},
  booktitle={SODA 1997},
  volume={97},
  pages={360--369},
  year={1997}
}

@article{BilleGortzSachVildhoj,
  title={{Time-space trade-offs for longest common extensions}},
  author={Bille, P. and G{\o}rtz, I. L. and Sach, B. and Vildh{\o}j, H. W.},
  journal={J. of Discrete Algorithms},
  volume={25},
  pages={42--50},
  year={2014},
  publisher={Elsevier}
}

@inproceedings{Blelloch,
  title={{Space-efficient dynamic orthogonal point location, segment intersection, and range reporting}},
  author={Blelloch, G. E.},
  booktitle={SODA 2008},
  pages={894--903},
  year={2008},
  organization={SIAM}
}

@inproceedings{BurkhardtKarkkainen,
  title={{Fast lightweight suffix array construction and checking}},
  author={Burkhardt, S. and K{\"a}rkk{\"a}inen, J.},
  booktitle={CPM 2003},
  volume={2676},
  series={LNCS},
  pages={55--69},
  year={2003},
  organization={Springer}
}

@inproceedings{ChanLarsenPatrascu,
  title={{Orthogonal range searching on the RAM, revisited}},
  author={Chan, T. M. and Larsen, K. G. and P{\u{a}}tra{\c{s}}cu, M.},
  booktitle={SoCG 2011},
  pages={1--10},
  year={2011},
  organization={ACM}
}

@article{BurrowsWheeler,
  title={{A block-sorting lossless data compression algorithm}},
  author={Burrows, M. and Wheeler, D. J.},
  journal={Technical Report 124},
  year={1994},
  publisher={{Digital Equipment Corporation, Palo Alto, California}}
}

@article{ColbournLing,
  title={{Quorums from difference covers}},
  author={Colbourn, C. J. and Ling, A. C.},
  journal={Information Processing Letters},
  volume={75},
  number={1},
  pages={9--12},
  year={2000},
  publisher={Elsevier}
}

@inproceedings{ColeHariharan,
  title={{Dynamic LCA queries on trees}},
  author={Cole, R. and Hariharan, R.},
  booktitle={SODA 1999},
  volume={99},
  pages={235--244},
  year={1999}
}

@article{FischerIKoppl,
  title={{Lempel-Ziv computation in small space (LZ-CISS)}},
  author={Fischer, J. and I, T. and K{\"o}ppl, D.},
  journal={arXiv preprint arXiv:1504.02605 (accepted to CPM 2015)},
  year={2015}
}

@inproceedings{FranceschiniGrossi,
  title={A general technique for managing strings in comparison-driven data structures},
  author={Franceschini, G. and Grossi, R.},
  booktitle={ICALP 2004},
  series={LNCS},
  volume={3142},
  pages={606--617},
  year={2004},
  publisher={Springer}
}

@article{FredmanWillard,
  title={{Surpassing the information theoretic bound with fusion trees}},
  author={Fredman, M. L. and Willard, D. E.},
  journal={J. of computer and system sciences},
  volume={47},
  number={3},
  pages={424--436},
  year={1993},
  publisher={Elsevier}
}

@incollection{GGKNP,
  title={{A faster grammar-based self-index}},
  author={Gagie, T. and Gawrychowski, P. and K{\"a}rkk{\"a}inen, J. and Nekrich, Y. and Puglisi, S. J.},
  booktitle={LATA 2012},
  series={LNCS},
  volume={7183},
  pages={240--251},
  year={2012},
  publisher={Springer}
}

@article{HagerupMiltersenPagh,
  title={{Deterministic dictionaries}},
  author={Hagerup, T. and Miltersen, P. B. and Pagh, R.},
  journal={J. of Algorithms},
  volume={41},
  number={1},
  pages={69--85},
  year={2001},
  publisher={Elsevier}
}

@inproceedings{HonSadakaneSung,
  title={{Breaking a time-and-space barrier in constructing full-text indices}},
  author={Hon, W.-K. and Sadakane, K. and Sung, W.-K.},
  booktitle={FOCS 2003},
  pages={251--260},
  year={2003},
  organization={IEEE}
}

@inproceedings{KarkkainenKempaPuglisi,
  title={{Lightweight Lempel-Ziv parsing}},
  author={K{\"a}rkk{\"a}inen, J. and Kempa, D. and Puglisi, S. J.},
  booktitle={SEA 2013},
  volume={7933},
  series={LNCS},
  pages={139--150},
  year={2013},
  publisher={Springer}
}

@inproceedings{KopelowitzLewenstein,
  title={{Dynamic weighted ancestors}},
  author={Kopelowitz, T. and Lewenstein, M.},
  booktitle={SODA 2007},
  pages={565--574},
  year={2007},
  organization={SIAM}
}

@inproceedings{Kosolobov,
  title = {{Lempel-Ziv factorization may be harder than computing all runs}},
  author ={Kosolobov, D.},
  booktitle ={STACS 2015},
  volume ={30},
  pages ={582--593},
  year ={2015},
  series = {LIPICS}
}

@inproceedings{KreftNavarro,
  title={{Self-indexing based on LZ77}},
  author={Kreft, S. and Navarro, G.},
  booktitle={CPM 2011},
  series={LNCS},
  volume={6661},
  pages={41--54},
  year={2011},
  organization={Springer}
}

@article{LempelZiv,
  title={{On the complexity of finite sequences}},
  author={Lempel, A. and Ziv, J.},
  journal={IEEE Transactions on Information Theory},
  volume={22},
  number={1},
  pages={75--81},
  year={1976},
  publisher={IEEE}
}

@article{NavarroSadakane,
  title={{Fully functional static and dynamic succinct trees}},
  author={Navarro, G. and Sadakane, K.},
  journal={ACM Transactions on Algorithms (TALG)},
  volume={10},
  number={3},
  pages={16},
  year={2014},
  publisher={ACM}
}

@inproceedings{OhlebuschGog,
  title={{Lempel-Ziv factorization revisited}},
  author={Ohlebusch, E. and Gog, S.},
  booktitle={CPM 2011},
  series={LNCS},
  volume={6661},
  pages={15--26},
  year={2011},
  organization={Springer}
}

@incollection{OkanoharaSadakane,
  title={{An online algorithm for finding the longest previous factors}},
  author={Okanohara, D. and Sadakane, K.},
  booktitle={Algorithms-ESA 2008},
  series={LNCS},
  volume={5193},
  pages={696--707},
  year={2008},
  publisher={Springer}
}

@inproceedings{RamanRamanRao,
  title={{Succinct indexable dictionaries with applications to encoding k-ary trees and multisets}},
  author={Raman, R. and Raman, V. and Rao, S. S.},
  booktitle={SODA 2002},
  pages={233--242},
  year={2002},
  organization={SIAM}
}

@incollection{Starikovskaya,
  title={{Computing Lempel-Ziv factorization online}},
  author={Starikovskaya, T.},
  booktitle={MFCS 2012},
  volume={7464},
  series={LNCS},
  pages={789--799},
  year={2012},
  publisher={Springer}
}

@inproceedings{YamamotoIBannaiInenagaTakeda,
  title={{Faster compact on-line Lempel-Ziv factorization}},
  author={Yamamoto, J. and I, T. and Bannai, H. and Inenaga, S. and Takeda, M.},
  booktitle={STACS 2014},
  volume={25},
  pages={675--686},
  year={2014},
  series={LIPICS}
}
